Result Computation for University of Ibadan Statistics Department Using Anonymous Threshold Scheme
نویسندگان
چکیده
In this paper, we constructed (2, 7)-anonymous threshold scheme from the (49, 56, 8, 7, 1) Resolvable Balanced Incomplete Block Design (RBIBD) using MATLAB codes. The (2, 7)-anonymous threshold scheme was then applied to Result Processing Scheme in the Department of Statistics, University of Ibadan. The scheme developed satisfied the security requirements of authenticity, integrity and verifiability thus making it better than the scheme currently being used in the Department. CCS Concepts • Security and privacy ➝ Security privacy ➝ Access control
منابع مشابه
National Health Insurance Scheme: How Protected Are Households in Oyo State, Nigeria from Catastrophic Health Expenditure?
Background The major objective of the National Health Insurance Scheme (NHIS) in Nigeria is to protect families from the financial hardship of large medical bills. Catastrophic Health Expenditure (CHE) is rampart in Nigeria despite the take-off of the NHIS. This study aimed to determine if households enrolled in the NHIS were protected from having CHE. Methods The study took place among 714 h...
متن کاملDesign and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملResidents’ Satisfaction with Adequacy of Facilities in Metropolitan Ibadan, Nigeria
The study examined the quantity and quality of infrastructure in Ibadan, Nigeria with a view to using information to providing policy guidelines for sustainable infrastructural development. Using stratified sampling technique, a total of fifteen wards from the five local government areas in Ibadan metropolis were selected for study. The selection of all the local government areas is based on th...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملOn the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کامل